Dr. Amr Elmasry

Profile

Academic position	Associate Professor, Senior Lecturer, Reader
Research fields	Theoretical Computer Science
Keywords	In-place algorithms, adaptive algorithms, comparison complexity of priority queues, computational geometry, self-adjusting data structures

Current contact address

Country	Egypt
City	Alexandria

Host during sponsorship

Prof. Dr. Dr. h.c. mult. Kurt Mehlhorn	Max-Planck-Institut für Informatik, Saarbrücken
Start of initial sponsorship	01/09/2008

Programme(s)

2007	Humboldt Research Fellowship Programme

Publications (partial selection)

2010	Amr Elmasry: The longest almost-increasing subsequence. In: Information Processing Letters, 2010, 655-658
2009	Amr Elmasry: Computing the subset partial order for dense families of sets. In: Information Processing Letters, 2009, 1082-1086
2008	Khaled Elbassioni, Amr Elmasry and Ibrahim Kamel Indexing schemes for multi-dimensional moving objects. In: Encyclopedia of GIS, 2008, 523-529
2008	Amr Elmasry and AbdelRahman Hammad: Inversion-sensitive sorting algorithms in practice. In: ACM Journal of Experimental Algorithms, 2008, Article 11
2008	Amr Elmasry, Claus Jensen and Jyrki Katajainen: Multipartite priority queues. In: ACM Transactions on Algorithms, 2008, Article 14
2008	Amr Elmasry, Claus Jensen and Jyrki Katajainen: Two new methods for transforming priority queues into double-ended priority queues. In: Computing, 2008, 193-204